Annotated Set Constraints ∗
نویسندگان
چکیده
A general class of program analyses are a combination of contextfree and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class. Our results extend the class of reachability problems expressible naturally in a single constraint formalism, including such diverse applications as interprocedural dataflow analysis, precise type-based flow analysis, and pushdown model checking.
منابع مشابه
SOLVING MULTI CONSTRAINTS STRUCTURAL TOPOLOGY OPTIMIZATION PROBLEM WITH REFORMULATION OF LEVEL SET METHOD
Due to the favorable performance of structural topology optimization to create a proper understanding in the early stages of design, this issue is taken into consideration from the standpoint of research or industrial application in recent decades. Over the last three decades, several methods have been proposed for topology optimization. One of the methods that has been effectively used in stru...
متن کاملA Survey on Models and Query Languages for Temporally Annotated RDF
In this paper, we provide a survey on the models and query languages for temporally annotated RDF. In most of the works, a temporally annotated RDF ontology is essentially a set of RDF triples associated with temporal constraints, where, in the simplest case, a temporal constraint is a validity temporal interval. However, a temporally annotated RDF ontology may also be a set of triples connecti...
متن کاملPoints-to Analysis for Java Based on Annotated Constraints
The goal of points-to analysis for Java is to determine the set of objects pointed to by a reference variable or a reference object field. In this paper we present a points-to analysis for Java based on Andersen’s points-to analysis for C [5]. Andersen’s analysis can be implemented efficiently by using systems of set-inclusion constraints and by employing several techniques for constraint repre...
متن کاملA Discriminative Graph-Based Parser for the Abstract Meaning Representation
Abstract Meaning Representation (AMR) is a semantic formalism for which a growing set of annotated examples is available. We introduce the first approach to parse sentences into this representation, providing a strong baseline for future improvement. The method is based on a novel algorithm for finding a maximum spanning, connected subgraph, embedded within a Lagrangian relaxation of an optimiz...
متن کاملContext Sensitivity for Points-to Analysis Using Annotated Inclusion Constraints
We present annotated inclusion constraints a new general framework that enables the modeling of different dimensions of flow analysis precision using inclusion constraint systems. The annotations are a powerful formalism that can be used to model a large variety of precision dimensions, such as field sensitivity, virtual dispatch, k-CFA context sensitivity and object sensitivity, which is a new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007